Restricted permutations and the wreath product
نویسندگان
چکیده
منابع مشابه
Wreath Product Symmetric Functions
We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the Littlewood-Richardson rule are studied. We also discuss the connection with representations of generalized symmetric groups.
متن کاملSimple permutations and pattern restricted permutations
A simple permutation is one that does not map any non-trivial interval onto an interval. It is shown that, if the number of simple permutations in a pattern restricted class of permutations is finite, the class has an algebraic generating function and is defined by a finite set of restrictions. Some partial results on classes with an infinite number of simple permutations are given. Examples of...
متن کاملRestricted permutations
Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations (and more general sequences) that underlies the idea of restriction and which gives rise to sets o...
متن کاملalgebra and wreath product convolution
We present a group theoretic construction of the Virasoro algebra in the framework of wreath products. This can be regarded as a counterpart of a geometric construction of Lehn in the theory of Hilbert schemes of points on a surface. Introduction It is by now well known that a direct sum ⊕ n≥0R(Sn) of the Grothendieck rings of symmetric groups Sn can be identified with the Fock space of the Hei...
متن کاملRestricted Permutations and Polygons
Several authors have examined connections among restricted permutations and different combinatorial structures. In this paper we establish a bijection between the set of permutations π which avoid 1322 and the set of odd-dissection convex polygons, where a permutation avoids ab2c if there are no i < j < k − 1 such that πiπjπk is order-isomorphic to abc. We also exhibit bijections between the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00443-0